Energy minimization techniques for real-time scheduling on multiprocessor platforms
نویسندگان
چکیده
The scheduling of systems of periodic tasks upon multiprocessor systems with processors of di ering speeds is considered. Computation speeds may di er because the system is comprised of di erent types of processors | i.e. it may be a uniformmultiprocessor platform. Alternatively, the platform may be comprised of identical processors with speeds that di er because some processors may have their voltage levels reduced in order to minimize energy consumption. Given a periodic task system, a condition is derived for minimizing the computing capacity of the multiprocessor system while ensuring all deadlines of the task system are met when scheduled using the earliest deadline rst (EDF) algorithm. A method of selecting the voltages of identical processors in order to meet this condition while minimizing the energy consumption is then presented. The resulting system is a platform of identical processors with di erent computation rates on which the task set can be scheduled using EDF.
منابع مشابه
Energy Minimization for Parallel Real-Time Systems with Malleable Jobs and Homogeneous Frequencies
In this work, we investigate the potential utility of parallelization for meeting real-time constraints and minimizing energy. We consider malleable Gang scheduling of implicitdeadline sporadic tasks upon multiprocessors. We first show the non-necessity of dynamic voltage/frequency regarding optimality of our scheduling problem. We adapt the canonical schedule for DVFS multiprocessor platforms ...
متن کاملMultiprocessor Scheduling For Real Time Systems Embedded Systems
energy-ef?cient tasks scheduling algorithm for real-time utility accrual real-time scheduling for multiprocessor multiprocessor real-time scheduling in industrial embedded a novel approach for off-line multiprocessor scheduling in multiprocessor scheduling for real time systems embedded robust partitioned scheduling for realtime multiprocessor multiprocessor scheduling for real time systems emb...
متن کاملEnergy-Efficient Scheduling of Periodic Real-Time Tasks over Homogeneous Multiprocessors
Different from many previous energy-efficient scheduling studies, this paper explores energy-efficient multiprocessor scheduling of periodic real-time tasks with different power consumption functions. When the goal is on the minimization of energy consumption, we propose a 1.412approximation algorithm in the derivation of a feasible schedule. A series of simulation experiments was done for the ...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملScheduling in multiprocessor systems pdf
Contemporary computer systems are multiprocessor or multicomputer machines. This chapter will introduce the basics of multiprocessor scheduling. Consequently, the eld of scheduling for multiprocessor systems.The main motivation for multiprocessor scheduling is the desire for increased. The scheduling problem for multiprocessor systems can be generally stated as.Concurrency implemented by schedu...
متن کامل